Distributed Finite-Time and Fixed-Time Nash Equilibrium Seeking for Non-Cooperative Game with Input Saturation
نویسندگان
چکیده
In this paper, a modified distributed Nash equilibrium seeking problem with input saturation has been investigated. The payoff function of each player is related to the communication topology, which closer actual scenes. sigmoid utilized limit range input. Through network between players and gradient players’ functions, finite-time fixed-time protocols are given. Using Lyapunov stability analysis, it determined that action converges if all update their according proposed algorithms. numerical simulations also provided testify
منابع مشابه
Finite-time Flocking of Multi-agent System with Input Saturation
In this paper a finite-time flocking of multi-agent system with input saturation is investigated. By introducing a new control protocol, it is show that speed and position of agents with double-integrator dynamics converge to the speed and position of leader in finite time. It is assumed that the graph between the agents is connected and that at least one agent is informed of the leader speed a...
متن کاملNash Equilibrium Seeking for Dynamic Systems with Non-Quadratic Payoffs
We consider a general, stable nonlinear dynamic system with N inputs and N outputs, where in the steady state, the output signals represent the non-quadratic payoff functions of a noncooperative game played by the values of the input signals. We introduce a non-model based approach for locally stable convergence to a steady-state Nash equilibrium. In classical game theory algorithms, each playe...
متن کاملContinuous-time integral dynamics for Aggregative Game equilibrium seeking
In this paper, we consider continuous-time semidecentralized dynamics for the equilibrium computation in a class of aggregative games. Specifically, we propose a scheme where decentralized projected-gradient dynamics are driven by an integral control law. To prove global exponential convergence of the proposed dynamics to an aggregative equilibrium, we adopt a quadratic Lyapunov function argume...
متن کاملNash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix
A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players’ actions. The players communicate over a strongly connected digraph to send/receive the estimates of the other players’ actions to/from the other local players according to a gossip communication protocol. Due to asymmetric infor...
متن کاملSimultaneous Nash Equilibrium Seeking and Social Cost Minimization in Graphical N -coalition Non-cooperative Games
This paper aims to reduce the communication and computation costs of the Nash equilibrium seeking strategy for the N -coalition non-cooperative games proposed in [1]. The objective is achieved in two manners: 1). the Nash equilibrium seeking strategy is re-designed and a new Nash equilibrium seeking algorithm that yields less communication and computation costs, is proposed. 2). an interference...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11102295